DBM-Tree: Trading height-balancing for performance in metric access methods
نویسندگان
چکیده
منابع مشابه
DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the query performance minimizing the number of disk accesses, keeping a constant height of the structures stored on disks (height-balanced trees). The Slim-tree and the M-tree are the most efficient dynamic MAM so far. However...
متن کاملRevisiting the DBM-Tree
In [Vieira et al. 2004] we presented a new dynamic Metric Access Method (MAM) called DBM-tree. This structure, unlike any other MAM, explores the varying density of elements in the dataset that allows creating, in a controlled way, unbalanced trees. Every dynamic MAM that works with persistent data proposed so far uses the same principle employed in conventional trees, like the B-tree [Comer 19...
متن کاملOn Fast Non-metric Similarity Search by Metric Access Methods
The retrieval of objects from a multimedia database employs a measure which defines a similarity score for every pair of objects. The measure should effectively follow the nature of similarity, hence, it should not be limited by the triangular inequality, regarded as a restriction in similarity modeling. On the other hand, the retrieval should be as efficient (or fast) as possible. The measure ...
متن کاملBulk-loading Dynamic Metric Access Methods
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. The proposed algorithm is sample-based, and it builds a height-balanced tree in a top-down fashion, using the metric domain’s distance function and a bound limit to group and determine the number of elements in each par...
متن کاملIncorporating Metric Access Methods for Similarity Searching on Oracle Database
The volume of multimedia and complex data (images, videos, audio, time series, DNA sequences, and others) has been growing at a very fast pace. Thus, it is necessary to store in databases many types of data which are not naturally handled by Database Management Systems (DBMSs). Complex data are well-suited to be queried by similarity. Many works addressed techniques for similarity searching, bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2005
ISSN: 0104-6500,1678-4804
DOI: 10.1007/bf03192381